Automatic construction of quality nonobtuse boundary Delaunay triangulations
نویسنده
چکیده
In this paper we discuss the automatic construction of quality nonobtuse boundary Delaunay triangulations of polygons such as needed for control volume or nite element method applications. These are Delaunay triangulations whose smallest angles are bounded and, in addition, whose boundary triangles do not have obtuse angles opposite to any boundary or interface edge. The method we propose in this paper consists on: (1) The construction of a constrained (good quality) De-launay triangulation of the polygon by using a Lepp-Delaunay algorithm (based on the longest-edge propagation path of target triangles); (2) A postprocess step which eliminates obtuse angles by Delaunay insertion of a nite number of adequate points on boundary or interface edges.
منابع مشابه
Automatic Construction of Quality Nonobtuse Boundary And/or Interface Delaunay Triangulations the Control Volume Methods
In this paper we discuss a new algorithm that for any input quality constrained Delaunay triangulation with minimum interior angle greater than or equal to 30 , produces a quality nonobtuse boundary and/or interface Delaunay triangulation by the Delaunay insertion of a nite number of boundary and/or interface points. A boundary (interface) obtuse triangle is a triangle that has an obtuse angle ...
متن کاملStrategies for Nonobtuse Boundary Delaunay Triangulations
Delaunay Triangulations with nonobtuse triangles at the boundaries satisfy a minimal requirement for Control Volume meshes. We motivate this quality requirement, discuss it in context with others that have been proposed, and give point placement strategies that generate the fewest or close to the fewest number of Steiner points needed to satisfy it for a particular problem instance. The advanta...
متن کاملNonobtuse Triangulations of PSLGs
We show that any planar PSLG with n vertices has a conforming triangulation by O(n) nonobtuse triangles, answering the question of whether a polynomial bound exists. The triangles may be chosen to be all acute or all right. A nonobtuse triangulation is Delaunay, so this result improves a previous O(n) bound of Eldesbrunner and Tan for conforming Delaunay triangulations. In the special case that...
متن کاملConstruction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
Three-dimensional Delaunay triangulations are the most common form of three-dimensional triangulations known, but they are not very suitable for tetrahedral nite element meshes because they tend to contain poorly-shaped sliver tetrahedra. In this paper, we present an algorithm for constructing improved-quality triangulations with respect to a tetrahedron shape measure. This algorithm uses combi...
متن کاملConstruction Of the Constrained Delaunay Triangulation Of A Polygonal Domain
A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay triangulation of a polygonal domain. The algorithm simplifies the complicated merging step inherent to divide-and-conquer algorithms for the computation of triangulations. Furthermore, no triangles are computed outside the valid region of the domain. A grid structure accelerat...
متن کامل